A Geometric Proof of the Enumeration Formula for Sturmian Words
نویسندگان
چکیده
The number of factors of length m of Sturmian words is known to be 1 + P m 1 (m ? i + 1)(i): We give a geometric proof of this formula, based on duality and on Euler's relation for planar graphs. Le nombre de facteurs de longueur m des mots de Sturm est connu pour ^ etre donn e par la formule 1 + P m 1 (m ? i + 1)(i): Nous donnons une preuve g eom etrique de ce resultat bas ee sur la dualit e et la relation d'Euler pour les graphes planaires.
منابع مشابه
Some characterizations of finite Sturmian words
In this paper we give some new characterizations of words which are finite factors of Sturmian words. An enumeration formula for primitive finite Sturmian words is given. Moreover, we provide two linear-time algorithms to recognize whether a finite word is Sturmian.
متن کاملA new geometric approach to Sturmian words
We introduce a new geometric approach to Sturmian words by means of a mapping that associates certain lines in the n× n-grid and sets of finite Sturmian words of length n. Using this mapping, we give new proofs of the formulas enumerating the finite Sturmian words and the palindromic finite Sturmian words of a given length. We also give a new proof for the well-known result that a factor of a S...
متن کاملCharacterization of Repetitions in Sturmian Words: A New Proof
We present a new, dynamical way to study powers (or repetitions) in Sturmian words based on results from Diophantine approximation theory. As a result, we provide an alternative and shorter proof of a result by Damanik and Lenz characterizing powers in Sturmian words [Powers in Sturmian Sequences, European J. Combin. 24 (2003), 377–390]. Further, as a consequence, we obtain a previously known f...
متن کاملComplete Characterization of Substitution Invariant Sturmian Sequences
We provide a complete characterization of substitution invariant inhomogeneous bidirectional pointed Sturmian sequences. The result is analogous to that obtained by Berthé et al. [5] and Yasutomi [21] for one-directional Sturmian words. The proof is constructive, based on the geometric representation of Sturmian words by a cut-and-project scheme.
متن کاملEnumeration and structure of trapezoidal words
Trapezoidal words are words having at most n+1 distinct factors of length n for every n ≥ 0. They therefore encompass finite Sturmian words. We give combinatorial characterizations of trapezoidal words and exhibit a formula for their enumeration. We then separate trapezoidal words into two disjoint classes: open and closed. A trapezoidal word is closed if it has a factor that occurs only as a p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJAC
دوره 3 شماره
صفحات -
تاریخ انتشار 1993